Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks

Approximation Algorithms for the Minimum-Length Corridor and Related Problems

Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rectangle and from the rectangular boundary. We present the first polynomial time constant ratio approximation algorithm for the MLC-R problem, which has been shown to be NP-hard [5].

MIMO Link Scheduling for Interference Cancellation in Dense Wireless Networks

This paper addresses the problem of fair scheduling of MIMO links in dense wireless network deployments where MIMO interference cancellation is carried out to optimize network performance. We formulate and solve an optimal MIMO link scheduling problem, where the goal is to maximize aggregate throughput while meeting a specified fairness criterion. Evaluations in a modified version of ns-3 show ...

Opportunistic transmission scheduling for multiuser MIMO systems

An opportunistic transmission scheduling scheme is proposed to make better use of the multiuser diversity gain in a MIMO system. The performance of a MIMO link is quantified by its information-theoretic capacity. Even though the base station has no knowledge of the transmission channel, the proposed algorithm generates a transmission randomizing matrix according to the distribution of the chann...

Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling

Multiuser MIMO Networks